BPP , Proof systems
نویسندگان
چکیده
We currently do not have a very good unconditional bound on the power of BPP — in particular, it could be that BPP = NEXP. Perhaps surprisingly, especially in light of the many randomized algorithms known, the current conjecture is that BPP is not more powerful than P. We will return to this point later in the semester when we talk about derandomization. What (unconditional) upper bounds can we place on BPP? Interestingly, we know that it is not more powerful than polynomial-size circuits; actually, the following theorem is also a good illustration of the power of non-uniformity.
منابع مشابه
Note on the Tableau Technique for Commutative Transition Systems
We define a class of transition systems called effective commutative transition systems (ECTS) and show, by generalising a tableaubased proof for BPP, that strong bisimilarity between any two states of such a transition system is decidable. It gives a general technique for extending decidability borders of strong bisimilarity for a wide class of infinite-state transition systems. This is demons...
متن کاملBranching Bisimilarity between Finite-State Systems and BPA or Normed BPP Is Polynomial-Time Decidable
In this paper we present polynomial time algorithms deciding branching bisimilarity between finite-state systems and several classes of infinite-state systems: BPA and normed BPP. The algorithm for BPA improves a previous one given by Kučera and Mayr, while the one for normed BPP demonstrates the polynomial-time decidability of the problem, which is unknown previously. The proof style follows a...
متن کاملComputational Complexity of Some Equivalence-Checking Problems
This habilitation thesis gives an overview of five papers of the author in the area of verification, in particular, in the study of computational complexity of equivalence checking problems and related areas. The first of these papers, Sawa, Jančar: Equivalences on Finite-State Systems are PTIME-hard (2005), shows that deciding any relation between bisimulation equivalence (bisimilarity) and tr...
متن کاملAnother Proof that BPP ⊆ PH ( and more )
We provide another proof of the Sipser–Lautemann Theorem by which BPP ⊆ MA (⊆ PH). The current proof is based on strong results regarding the amplification of BPP, due to Zuckerman (1996). Given these results, the current proof is even simpler than previous ones. Furthermore, extending the proof leads to two results regarding MA: MA ⊆ ZPP (which seems to be new), and that two-sided error MA equ...
متن کاملOne-sided Versus Two-sided Error in Probabilistic Computation
We demonstrate how to use Lautemann's proof that BPP is in p 2 to exhibit that BPP is in RP PromiseRP. Immediate consequences show that if PromiseRP is easy or if there exist quick hitting set generators then P = BPP. Our proof vastly simpliies the proofs of the later result due to Andreev, Clementi and Rolim and Andreev, Clementi, Rolim and Trevisan. Clementi, Rolim and Trevisan question wheth...
متن کامل